Characterizing Pseudoprimes for Third-Order Linear Recurrences
نویسندگان
چکیده
منابع مشابه
Characterizing Pseudoprimes for Third-Order Linear Recurrences
This paper continues the work begun by D. Shanks and myself in [1] where certain cubic recurrences were used to give a very strong primality test. A complete characterization of the pseudoprimes for this test is given in terms of the periods of the corresponding sequences. Then these results are used to produce various types of pseudoprimes. A discussion of open problems is included.
متن کاملPseudoprimes for Higher-order Linear Recurrence Sequences
With the advent of high-speed computing, there is a rekindled interest in the problem of determining when a given whole number N > 1 is prime or composite. While complex algorithms have been developed to settle this for 200-digit numbers in a matter of minutes with a supercomputer, there is a need for simpler, more practical algorithms for dealing with numbers of a more modest size. Such practi...
متن کاملLinear Recurrences of Order Two
where the A{ are rational integers, is called an integral linear recurrence of order k. Given such a linear recurrence and an integer c, one would like to know for what n does f(n) — c? In a very few particular instances (e.g. see [2], [6]) this question has been answered, but in general the question is very difficult. A less exacting problem is the determination of upper and lower bounds on th...
متن کاملThe Generation of Higher-order Linear Recurrences from Second-order Linear Recurrences
Along the lines of this theorem, Selmer [1] has shown how one can form a higher-order linear recurrence consisting of the term-wise products of two other linear recurrences. In particular, let {sn} be an m-order and {tn} be a p-order linear integral recurrence with the associated polynomials s(x) and t(x), respectively. Let a^, i = 1,2, ..., m, and 3j, j = 1, 2, ..., p, be the roots of the poly...
متن کاملSecond-order Linear Recurrences of Composite Numbers
In a well-known result, Ronald Graham found a Fibonacci-like sequence whose two initial terms are relatively prime and which consists only of composite integers. We generalize this result to nondegenerate second-order recurrences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1987
ISSN: 0025-5718
DOI: 10.2307/2007869